Centerpoints: A Link between Optimization and Convex Geometry

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Centerpoints: A Link Between Optimization and Convex Geometry

We introduce a concept that generalizes several different notions of a “centerpoint” in the literature. We develop an oracle-based algorithm for convex mixed-integer optimization based on centerpoints. Further, we show that algorithms based on centerpoints are “best possible” in a certain sense. Motivated by this, we establish structural results about this concept and provide efficient algorith...

متن کامل

Non-Convex Optimization via Real Algebraic Geometry

The high level purpose of this paper is to describe some recent advances in the field of Mathematics called Real Algebraic Geometry, and discuss some of its applications to complexity theory, and non-convex optimization. In particular, one of the questions underlying the entire development, is the crucial question: What makes an optimization problem difficult or easy? Along the way, we try to p...

متن کامل

Real Algebraic Geometry in Convex Optimization

Real Algebraic Geometry in Convex Optimization

متن کامل

Links between Join Processing and Convex Geometry

This talk will survey some results on join processing that use inequalities from convex geometry. Recently, Ngo, Porat, Rudra, and Ré (NPRR) discovered the first relational join algorithm with worst-case optimal running time [8]. Since the seminal System R project [12], the dominant database optimizer paradigm optimizes a join query by examining each pair of joins and then combining these estim...

متن کامل

SIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD

In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Optimization

سال: 2017

ISSN: 1052-6234,1095-7189

DOI: 10.1137/16m1092908